Results for 'Is Arithmetic Consistent'

978 found
Order:
  1.  31
    Huw price.Is Arithmetic Consistent & Graham Priest - 1994 - Mind 103 (411).
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  2. Is arithmetic consistent?Graham Priest - 1994 - Mind 103 (411):337-349.
  3.  84
    Herbrand consistency of some finite fragments of bounded arithmetical theories.Saeed Salehi - 2013 - Archive for Mathematical Logic 52 (3-4):317-333.
    We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of IΔ0 whose Herbrand Consistency is not provable in IΔ0. We also show the existence of an IΔ0-derivable Π1-sentence such that IΔ0 cannot prove its Herbrand Consistency.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  4.  51
    Consistency of Heyting arithmetic in natural deduction.Annika Kanckos - 2010 - Mathematical Logic Quarterly 56 (6):611-624.
    A proof of the consistency of Heyting arithmetic formulated in natural deduction is given. The proof is a reduction procedure for derivations of falsity and a vector assignment, such that each reduction reduces the vector. By an interpretation of the expressions of the vectors as ordinals each derivation of falsity is assigned an ordinal less than ε 0, thus proving termination of the procedure.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  5.  21
    Consistency and Decidability in Some Paraconsistent Arithmetics.Andrew Tedder - 2021 - Australasian Journal of Logic 18 (5):473-502.
    The standard style of argument used to prove that a theory is unde- cidable relies on certain consistency assumptions, usually that some fragment or other is negation consistent. In a non-paraconsistent set- ting, this amounts to an assumption that the theory is non-trivial, but these diverge when theories are couched in paraconsistent logics. Furthermore, there are general methods for constructing inconsistent models of arithmetic from consistent models, and the theories of such inconsistent models seem likely to differ (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Consistency proof of a fragment of pv with substitution in bounded arithmetic.Yoriyuki Yamagata - 2018 - Journal of Symbolic Logic 83 (3):1063-1090.
    This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  55
    Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
    Gödel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand consistency and bounded arithmetic, Fundamenta Mathematical vol. 171 (2002), pp. 279-292]. In that paper, it was shown that one cannot always shrink the witness of a bounded formula logarithmically, but in the presence of Herbrand consistency, for theories I∆₀+ Ωm, with m ≥ 2, any witness for (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  22
    The Consistency of Arithmetic.Robert Meyer - 2021 - Australasian Journal of Logic 18 (5):289-379.
    This paper offers an elementary proof that formal arithmetic is consistent. The system that will be proved consistent is a first-order theory R♯, based as usual on the Peano postulates and the recursion equations for + and ×. However, the reasoning will apply to any axiomatizable extension of R♯ got by adding classical arithmetical truths. Moreover, it will continue to apply through a large range of variation of the un- derlying logic of R♯, while on a simple (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  30
    Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
    We define and study a new restricted consistency notion RCon ∗ for bounded arithmetic theories T 2 j . It is the strongest ∀ Π 1 b -statement over S 2 1 provable in T 2 j , similar to Con in Krajíček and Pudlák, 29) or RCon in Krajı́ček and Takeuti 107). The advantage of our notion over the others is that RCon ∗ can directly be used to construct models of T 2 j . We apply this (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  29
    When is arithmetic possible?Gregory L. McColm - 1990 - Annals of Pure and Applied Logic 50 (1):29-51.
    When a structure or class of structures admits an unbounded induction, we can do arithmetic on the stages of that induction: if only bounded inductions are admitted, then clearly each inductively definable relation can be defined using a finite explicit expression. Is the converse true? We examine evidence that the converse is true, in positive elementary induction . We present a stronger conjecture involving the language L consisting of all L∞ω formulas with a finite number of variables, and examine (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11. How to prove the consistency of arithmetic.Jaakko Hintikka & Besim Karakadilar - 2006 - Acta Philosophica Fennica 78:1.
    It is argued that the goal of Hilbert's program was to prove the model-theoretical consistency of different axiom systems. This Hilbert proposed to do by proving the deductive consistency of the relevant systems. In the extended independence-friendly logic there is a complete proof method for the contradictory negations of independence-friendly sentences, so the existence of a single proposition that is not disprovable from arithmetic axioms can be shown formally in the extended independence-friendly logic. It can also be proved by (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  17
    (1 other version)The Consistency of Arithmetic: And Other Essays.Storrs McCall - 2014 - Oxford and New York: Oxford University Press USA.
    This volume contains six new and fifteen previously published essays -- plus a new introduction -- by Storrs McCall. Some of the essays were written in collaboration with E. J. Lowe of Durham University. The essays discuss controversial topics in logic, action theory, determinism and indeterminism, and the nature of human choice and decision. Some construct a modern up-to-date version of Aristotle's bouleusis, practical deliberation. This process of practical deliberation is shown to be indeterministic but highly controlled and the antithesis (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  65
    On Herbrand consistency in weak arithmetic.Zofia Adamowicz & Paweł Zbierski - 2001 - Archive for Mathematical Logic 40 (6):399-413.
    We prove that the Gödel incompleteness theorem holds for a weak arithmetic T = IΔ0 + Ω2 in the form where Cons H (T) is an arithmetic formula expressing the consistency of T with respect to the Herbrand notion of provability.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  14. On Proving Consistency of Equational Theories in Bounded Arithmetic.Arnold Beckmann & Yoriyuki Yamagata - 2025 - Journal of Symbolic Logic 90 (1):135-165.
    We consider equational theories based on axioms for recursively defining functions, with rules for equality and substitution, but no form of induction—we denote such equational theories as PETS for pure equational theories with substitution. An example is Cook’s system PV without its rule for induction. We show that the Bounded Arithmetic theory $\mathrm {S}^{1}_2$ proves the consistency of PETS. Our approach employs model-theoretic constructions for PETS based on approximate values resembling notions from domain theory in Bounded Arithmetic, which (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Internal and external consistency of arithmetic.Yvon Gauthier - 2001 - Logica Trianguli 5:19-41.
    What Gödel referred to as “outer” consistency is contrasted with the “inner” consistency of arithmetic from a constructivist point of view. In the settheoretic setting of Peano arithmetic, the diagonal procedure leads out of the realm of natural numbers. It is shown that Hilbert’s programme of arithmetization points rather to an “internalisation” of consistency. The programme was continued by Herbrand, Gödel and Tarski. Tarski’s method of quantifier elimination and Gödel’s Dialectica interpretation are part and parcel of Hilbert’s finitist (...)
     
    Export citation  
     
    Bookmark  
  16.  69
    (1 other version)Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.
    The 1-consistency of arithmetic is shown to be equivalent to the existence of fixed points of a certain type of update procedure, which is implicit in the epsilon-substitution method.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  17.  31
    Arithmetic Formulated Relevantly.Robert Meyer - 2021 - Australasian Journal of Logic 18 (5):154-288.
    The purpose of this paper is to formulate first-order Peano arithmetic within the resources of relevant logic, and to demonstrate certain properties of the system thus formulated. Striking among these properties are the facts that it is trivial that relevant arithmetic is absolutely consistent, but classical first-order Peano arithmetic is straightforwardly contained in relevant arithmetic. Under, I shall show in particular that 0 = 1 is a non-theorem of relevant arithmetic; this, of course, is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  18. Comparing Peano arithmetic, Basic Law V, and Hume’s Principle.Sean Walsh - 2012 - Annals of Pure and Applied Logic 163 (11):1679-1709.
    This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields, and formalizing these techniques within various subsystems of second-order Peano arithmetic allows one to put upper and lower bounds on the interpretability strength of these theories and hence to compare these theories to the canonical subsystems of second-order arithmetic. The main results of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  19. The Relationship of Arithmetic As Two Twin Peano Arithmetic(s) and Set Theory: A New Glance From the Theory of Information.Vasil Penchev - 2020 - Metaphilosophy eJournal (Elseviers: SSRN) 12 (10):1-33.
    The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20. Developing Artificial Human-Like Arithmetical Intelligence (and Why).Markus Pantsar - 2023 - Minds and Machines 33 (3):379-396.
    Why would we want to develop artificial human-like arithmetical intelligence, when computers already outperform humans in arithmetical calculations? Aside from arithmetic consisting of much more than mere calculations, one suggested reason is that AI research can help us explain the development of human arithmetical cognition. Here I argue that this question needs to be studied already in the context of basic, non-symbolic, numerical cognition. Analyzing recent machine learning research on artificial neural networks, I show how AI studies could potentially (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  21.  67
    On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency.Dan E. Willard - 2006 - Journal of Symbolic Logic 71 (4):1189-1199.
    Gödel’s Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We will show that axiomatizations for a computer’s floating point arithmetic can recognize their cut-free consistency in a stronger respect than is feasible under integer arithmetics. This paper will include both new generalizations of the Second Incompleteness Theorem and techniques for evading it.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  22. Arithmetical truth and hidden higher-order concepts.Daniel Isaacson - 1987 - In Logic Colloquium '85: Proceedings of the Colloquium held in Orsay, France July 1985 (Studies in Logic and the Foundations of Mathematics, Vol. 122.). Amsterdam, New York, Oxford, Tokyo: North-Holland. pp. 147-169.
    The incompleteness of formal systems for arithmetic has been a recognized fact of mathematics. The term “incompleteness” suggests that the formal system in question fails to offer a deduction which it ought to. This chapter focuses on the status of a formal system, Peano Arithmetic, and explores a viewpoint on which Peano Arithmetic occupies an intrinsic, conceptually well-defined region of arithmetical truth. The idea is that it consists of those truths which can be perceived directly from the (...)
     
    Export citation  
     
    Bookmark   4 citations  
  23. Sub-Theory of Peano Arithmetic.Andrew Boucher - unknown
    The system called F is essentially a sub-theory of Frege Arithmetic without the ad infinitum assumption that there is always a next number. In a series of papers (Systems for a Foundation of Arithmetic, True” Arithmetic Can Prove Its Own Consistency and Proving Quadratic Reciprocity) it was shown that F proves a large number of basic arithmetic truths, such as the Euclidean Algorithm, Unique Prime Factorization (i.e. the Fundamental Law of Arithmetic), and Quadratic Reciprocity, indeed (...)
     
    Export citation  
     
    Bookmark  
  24.  51
    Inconsistent Models (and Infinite Models) for Arithmetics with Constructible Falsity.Thomas Macaulay Ferguson - 2019 - Logic and Logical Philosophy 28 (3):389-407.
    An earlier paper on formulating arithmetic in a connexive logic ended with a conjecture concerning C♯, the closure of the Peano axioms in Wansing’s connexive logic C. Namely, the paper conjectured that C♯ is Post consistent relative to Heyting arithmetic, i.e., is nontrivial if Heyting arithmetic is nontrivial. The present paper borrows techniques from relevant logic to demonstrate that C♯ is Post consistent simpliciter, rendering the earlier conjecture redundant. Given the close relationship between C and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25.  22
    Another Arithmetic of the Even and the Odd.Celia Schacht - 2018 - Review of Symbolic Logic 11 (3):604-608.
    This article presents an axiom system for an arithmetic of the even and the odd, one that is stronger than those discussed in Pambuccian (2016) and Menn & Pambuccian (2016). It consists of universal sentences in a language extending the usual one with 0, 1, +, ·, <, – with the integer part of the half function$[{ \cdot \over 2}]$, and two unary operation symbols.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26. General arithmetic.Andrew Boucher - manuscript
    General Arithmetic is the theory consisting of induction on a successor function. Normal arithmetic, say in the system called Peano Arithmetic, makes certain additional demands on the successor function. First, that it be total. Secondly, that it be one-to-one. And thirdly, that there be a first element which is not in its image. General Arithmetic abandons all of these further assumptions, yet is still able to prove many meaningful arithmetic truths, such as, most basically, Commutativity (...)
     
    Export citation  
     
    Bookmark  
  27. Hilbert arithmetic as a Pythagorean arithmetic: arithmetic as transcendental.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (54):1-24.
    The paper considers a generalization of Peano arithmetic, Hilbert arithmetic as the basis of the world in a Pythagorean manner. Hilbert arithmetic unifies the foundations of mathematics (Peano arithmetic and set theory), foundations of physics (quantum mechanics and information), and philosophical transcendentalism (Husserl’s phenomenology) into a formal theory and mathematical structure literally following Husserl’s tracе of “philosophy as a rigorous science”. In the pathway to that objective, Hilbert arithmetic identifies by itself information related to finite (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28.  53
    Arithmetic, enumerative induction and size bias.A. C. Paseau - 2021 - Synthese 199 (3-4):9161-9184.
    Number theory abounds with conjectures asserting that every natural number has some arithmetic property. An example is Goldbach’s Conjecture, which states that every even number greater than 2 is the sum of two primes. Enumerative inductive evidence for such conjectures usually consists of small cases. In the absence of supporting reasons, mathematicians mistrust such evidence for arithmetical generalisations, more so than most other forms of non-deductive evidence. Some philosophers have also expressed scepticism about the value of enumerative inductive evidence (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  29.  13
    Relevant Arithmetic and Mathematical Pluralism.Zach Weber - 2021 - Australasian Journal of Logic 18 (5):569-596.
    In The Consistency of Arithmetic and elsewhere, Meyer claims to “repeal” Goedel’s second incompleteness theorem. In this paper, I review his argument, and then consider two ways of understanding it: from the perspective of mathematical pluralism and monism, respectively. Is relevant arithmetic just another legitimate practice among many, or is it a rival of its classical counterpart—a corrective to Goedel, setting us back on the path to the (One) True Arithmetic? To help answer, I sketch a few (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30. Two weak arithmetics.Peter Smith - unknown
    Our last big theorem – Theorem 6 – tells us that if a theory meets certain conditions, then it must be negation incomplete. And we made some initial arm-waving remarks to the effect that it seems plausible that we should want theories which meet those conditions. Later, we announced that there actually is a consistent weak arithmetic with a first-order logic which meets the conditions (in which case, stronger arithmetics will also meet the conditions); but we didn’t say (...)
     
    Export citation  
     
    Bookmark  
  31.  30
    Arithmetical Completeness Theorem for Modal Logic mathsfmathsf{}.Taishi Kurahashi - 2018 - Studia Logica 106 (2):219-235.
    We prove that for any recursively axiomatized consistent extension T of Peano Arithmetic, there exists a \ provability predicate of T whose provability logic is precisely the modal logic \. For this purpose, we introduce a new bimodal logic \, and prove the Kripke completeness theorem and the uniform arithmetical completeness theorem for \.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  32. The Consistency of predicative fragments of Frege’s Grundgesetze der Arithmetik.Richard G. Heck - 1996 - History and Philosophy of Logic 17 (1-2):209-220.
    As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell's Paradox being derivable in it. This system is, except for minor differences, full second-order logic, augmented by a single non-logical axiom, Frege's Axiom V. It has been known for some time now that the first-order fragment of the theory is consistent. The present paper establishes that both the simple and the ramified predicative second-order fragments are consistent, and that Robinson (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   60 citations  
  33.  43
    Arithmetical Soundness and Completeness for $$\varvec{\Sigma }_{\varvec{2}}$$ Numerations.Taishi Kurahashi - 2018 - Studia Logica 106 (6):1181-1196.
    We prove that for each recursively axiomatized consistent extension T of Peano Arithmetic and \, there exists a \ numeration \\) of T such that the provability logic of the provability predicate \\) naturally constructed from \\) is exactly \ \rightarrow \Box p\). This settles Sacchetti’s problem affirmatively.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  34.  67
    Arithmetical interpretations and Kripke frames of predicate modal logic of provability.Taishi Kurahashi - 2013 - Review of Symbolic Logic 6 (1):1-18.
    Solovay proved the arithmetical completeness theorem for the system GL of propositional modal logic of provability. Montagna proved that this completeness does not hold for a natural extension QGL of GL to the predicate modal logic. Let Th(QGL) be the set of all theorems of QGL, Fr(QGL) be the set of all formulas valid in all transitive and conversely well-founded Kripke frames, and let PL(T) be the set of all predicate modal formulas provable in Tfor any arithmetical interpretation. Montagna’s results (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  60
    Consistency, optimality, and incompleteness.Yijia Chen, Jörg Flum & Moritz Müller - 2013 - Annals of Pure and Applied Logic 164 (12):1224-1235.
    Assume that the problem P0 is not solvable in polynomial time. Let T be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{ConT} as the minimal extension of T proving for some algorithm that it decides P0 as fast as any algorithm B with the property that T proves that B decides P0. Here, ConT claims the consistency of T. As a byproduct, we obtain a version of Gödelʼs Second Incompleteness Theorem. Moreover, we characterize (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  36.  45
    The cerebral, extra-cerebral bodily, and socio-cultural dimensions of enculturated arithmetical cognition.Regina E. Fabry - 2020 - Synthese 197 (9):3685-3720.
    Arithmetical cognition is the result of enculturation. On a personal level of analysis, enculturation is a process of structured cultural learning that leads to the acquisition of evolutionarily recent, socio-culturally shaped arithmetical practices. On a sub-personal level, enculturation is realized by learning driven plasticity and learning driven bodily adaptability, which leads to the emergence of new neural circuitry and bodily action patterns. While learning driven plasticity in the case of arithmetical practices is not consistent with modularist theories of mental (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  37.  96
    (1 other version)Inconsistent models for relevant arithmetics.Robert Meyer & Chris Mortensen - 1984 - Journal of Symbolic Logic 49 (3):917-929.
    This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6]. In those works, Peano’s axioms for arithmetic were formulated with a logical base of the relevant logic R, and it was proved finitistically that the resulting arithmetic, called R♯, was absolutely consistent. It was pointed out that such a result escapes incau- tious formulations of Goedel’s second incompleteness theorem, and provides a basis for a revived Hilbert programme. The absolute consistency result (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   41 citations  
  38.  22
    Arithmetic Sinn and Effectiveness.Stewart Shapiro - 1984 - Dialectica 38 (1):3-16.
    SummaryAccording to Dummett's understanding of Frege, the sense of a denoting expression is a procedure for determining its denotation. The purpose of this article is to pursue this suggestion and develop a semi‐formal interpretation of Fregean sense for the special case of a first‐order language of arithmetic. In particular, we define the sense of each arithmetic expression to be a hypothetical process to determine the denoted number or truth value. The sense‐process is “hypothetical” in that the senses of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  85
    Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
    Gurevich and Shelah have shown that Peano Arithmetic cannot be interpreted in the monadic second-order theory of short chains (hence, in the monadic second-order theory of the real line). We will show here that it is consistent that the monadic second-order theory of no chain interprets Peano Arithmetic.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  40.  93
    Compositionality in language and arithmetic.Carlos Montemayor & Fuat Balci - 2007 - Journal of Theoretical and Philosophical Psychology 27 (1):53-72.
    The lack of conceptual analysis within cognitive science results in multiple models of the same phenomena. However, these models incorporate assumptions that contradict basic structural features of the domain they are describing. This is particularly true about the domain of mathematical cognition. In this paper we argue that foundational theoretic aspects of psychological models for language and arithmetic should be clarified before postulating such models. We propose a means to clarify these foundational concepts by analyzing the distinctions between metric (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  41.  45
    Consistency is not overrated.Carl Tollef Solberg, Ole Frithjof Norheim & Mathias Barra - 2019 - Journal of Medical Ethics 45 (12):830-831.
    In a recent paper— The disvalue of death in the global burden of disease 1—we question the commensurability of the two components of the disability-adjusted life year (DALY)— years lived with disability (YLDs) and years of life lost (YLLs)—and offer a tentative solution to this problem. In an exciting and constructive reply— Is consistency overrated? 2—philosopher S Andrew Schroeder argues that our concern about the DALY may be missing the mark by accepting the DALY as what he refers to as (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  42.  80
    Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
    We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  43.  47
    Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.
    By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of bounded quantifier complexity of fragments of first-order Peano Arithmetic. Here, we improve that result and show that this property describes a general phenomenon valid for parameter free schemes. As a consequence, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  44. On the Consistency of a Plural Theory of Frege’s Grundgesetze.Francesca Boccuni - 2011 - Studia Logica 97 (3):329-345.
    PG (Plural Grundgesetze) is a predicative monadic second-order system which is aimed to derive second-order Peano arithmetic. It exploits the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. In this paper, a model-theoretical consistency proof for the system PG is provided.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  45.  96
    Predicate Logics of Constructive Arithmetical Theories.Albert Visser - 2006 - Journal of Symbolic Logic 71 (4):1311 - 1326.
    In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete $\Pi _{2}^{0}$. Similarly, we show that the predicate logic of HA*, i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete $\Pi _{2}^{0}$. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove 'categoricity of interpretations' under certain assumptions.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  50
    On arithmetic in the Cantor- Łukasiewicz fuzzy set theory.Petr Hájek - 2005 - Archive for Mathematical Logic 44 (6):763-782.
    Axiomatic set theory with full comprehension is known to be consistent in Łukasiewicz fuzzy predicate logic. But we cannot assume the existence of natural numbers satisfying a simple schema of induction; this extension is shown to be inconsistent.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  47. Husserl’s Philosophy of Arithmetic in Reviews.Carlo Ierna - 2013 - The New Yearbook for Phenomenology and Phenomenological Philosophy 12:198-242.
    This present collection of (translations of) reviews is intended to help obtain a more balanced picture of the reception and impact of Edmund Husserl’s first book, the 1891 Philosophy of Arithmetic. One of the insights to be gained from this non-exhaustive collection of reviews is that the Philosophy of Arithmetic had a much more widespread reception than hitherto assumed: in the present collection alone there already are fourteen, all published between 1891 and 1895. Three of the reviews appeared (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  48. Reflecting in epistemic arithmetic.Leon Horsten - 1996 - Journal of Symbolic Logic 61 (3):788-801.
    An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  49.  51
    Gentzen’s consistency proof without heightlines.Annika Siders - 2013 - Archive for Mathematical Logic 52 (3-4):449-468.
    This paper gives a Gentzen-style proof of the consistency of Heyting arithmetic in an intuitionistic sequent calculus with explicit rules of weakening, contraction and cut. The reductions of the proof, which transform derivations of a contradiction into less complex derivations, are based on a method for direct cut-elimination without the use of multicut. This method treats contractions by tracing up from contracted cut formulas to the places in the derivation where each occurrence was first introduced. Thereby, Gentzen’s heightline argument, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  46
    Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice.Hajime Ishihara, Maria Emilia Maietti, Samuele Maschio & Thomas Streicher - 2018 - Archive for Mathematical Logic 57 (7-8):873-888.
    Consistency with the formal Church’s thesis, for short CT, and the axiom of choice, for short AC, was one of the requirements asked to be satisfied by the intensional level of a two-level foundation for constructive mathematics as proposed by Maietti and Sambin From sets and types to topology and analysis: practicable foundations for constructive mathematics, Oxford University Press, Oxford, 2005). Here we show that this is the case for the intensional level of the two-level Minimalist Foundation, for short MF, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 978